A Geometric Approach to Ergodic Non-homogeneous Markov Chains
نویسنده
چکیده
Inspired by the recent work of Daubechies and Lagarias on a set of matrices with convergent innnite products, we establish a new geometric approach to the classical problem of (weakly) ergodic non-homogeneous Markov chains. The existing key inequalities (related to the Hajnal inequality) in the literature are uniied in this geometric picture. A more general inequality is established. Important quantities introduced by various authors are easily interpreted. A quantitative connection is established between the classical work of Hajnal and the more recent one of Daubechies and Lagarias. 1. Overview In this paper, we restrict ourselves to Markov chains on nite states. Section 2 and 3 together serve as an introductory section, where the historical background and recent development are brieey reviewed, and our motivation and new results are introduced. In Section 2, we review the literature of ergodic non-homogeneous Markov chains 1, 2, 4, 5, 8, 10]. The basic meaning of ergodicity is explained. Section 3 displays the eeorts of several authors to characterize the conditions for ergodicity. Hajnal's inequality 5] is singled out for its signiicant role in this course. Our most general inequality is introduced. New concepts such as-Markov chains and LCP (left-convergent-products, Daubechies and Lagarias 2]) are deened. We also claim that the projected jointed spectral radius of Daubechies and Lagarias can be characterized in a new way. Section 4 shows the motivation of our geometric approach by working out the simple example of Cantorian (non-homogeneous) Markov chains. It
منابع مشابه
Estimation of the Entropy Rate of ErgodicMarkov Chains
In this paper an approximation for entropy rate of an ergodic Markov chain via sample path simulation is calculated. Although there is an explicit form of the entropy rate here, the exact computational method is laborious to apply. It is demonstrated that the estimated entropy rate of Markov chain via sample path not only converges to the correct entropy rate but also does it exponential...
متن کاملNecessary and Sufficient Conditions for Global Geometric Convergence of Block Gauss-seidel Iteration Algorithm Applied to Markov Chains
Convergence properties of the block Gauss-Seidel algorithm applied to ergodic Markov chains are discussed in this paper. This algorithm is one of the most prevalent methods for computing ergodic probability vectors of large-scale Markov chains. We will provide necessary and sufficient conditions for global geometric convergence of this algorithm. To apply this algorithm, the state space of a Ma...
متن کاملThree Kinds of Geometric Convergence for Markov Chains and the Spectral Gap Property
In this paper we investigate three types of convergence for geometrically ergodic Markov chains (MCs) with countable state space, which in general lead to different ‘rates of convergence’. For reversible Markov chains it is shown that these rates coincide. For general MCs we show some connections between their rates and those of the associated reversed MCs. Moreover, we study the relations betw...
متن کاملSingularly Perturbed Finite Markov Chains with General Ergodic Structure
We analyse singularly perturbed Markov chains. Most previous research has been done under the assumption that the perturbed Markov chain is either ergodic or unichain. In this paper we do not impose any restrictions on the ergodic structure of the perturbed chain. The present approach is based on the inversion of analytic matrix-valued functions.
متن کاملGeometric Ergodicity and the Spectral Gap of Non-Reversible Markov Chains
We argue that the spectral theory of non-reversible Markov chains may often be more effectively cast within the framework of the naturally associated weighted-L∞ space L V ∞ , instead of the usual Hilbert space L2 = L2(π), where π is the invariant measure of the chain. This observation is, in part, based on the following results. A discrete-time Markov chain with values in a general state space...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2000